Asymptotic behavior of the number of Eulerian orientations of graphs

Asymptotic behavior of the number of Eulerian orientations of graphs

ideological and cultural orientations in translation of narrative text: the case of hajji baba of isfahan

در میان عواملی که ممکن است ذهن مترجم را هنگام ترجمه تحت تأثیر قرار دهند، می توان به مقوله انتقال ایدئولوژی از طریق متن یا گفتمان اشاره کرد. هدف از این تحقیق تجزیه و تحلیل جنبه های ایدئولوژیکی و فرهنگی متن مبدأ انگلیسی نوشته جیمز موریه تحت عنوان سرگذشت حاجی بابای اصفهانی ( 1823) و ترجمه فارسی میرزا حبیب اصفهانی(1880) بوده است.

Reliable Orientations of Eulerian Graphs

We present a characterization of Eulerian graphs that have a k-arc-connected orientation so that the deletion of any vertex results in a (k− 1)-arc-connected directed graph. This provides an affirmative answer for a conjecture of Frank [2]. The special case, when k = 2, describes Eulerian graphs admitting 2-vertexconnected orientations. This case was proved earlier by Berg and Jordán [1]. These...

Counting the Number of Eulerian Orientations

Consider an undirected Eulerian graph, a graph in which each vertex has even degree. An Eulerian orientation of the graph is an orientation of its edges such that for each vertex v, the number of incoming edges of v equals to outgoing edges of v, i.e. din(v) = dout(v). Let P0 denote the set of all Eulerian orientations of graph G. In this paper, we are concerned with the questions of sampling u...

On the number of planar Eulerian orientations

The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count families of subsets and supersets of planar Eulerian orientations, indexed by an integer k, that converge to the set of all planar Eulerian orientations as k incre...